package leetcode81_90;

/**
 * @author shhjiang_001
 * @create 2020-06-25 11:15
 */

        /*
        给定一个仅包含 0 和 1 的二维二进制矩阵，找出只包含 1 的最大矩形，并返回其面积。
        示例:
        输入:
        [
        ["1","0","1","0","0"],
        ["1","0","1","1","1"],
        ["1","1","1","1","1"],
        ["1","0","0","1","0"]
        ]
        输出: 6
        */


public class Solution85 {
    public int maximalRectangle(char[][] matrix) {
        int res = 0;

        return 0;
    }
}
